-
1 reducible graph
Большой англо-русский и русско-английский словарь > reducible graph
-
2 reducible graph
Математика: приводимый граф -
3 reducible graph
мат. -
4 приводимый граф
Большой англо-русский и русско-английский словарь > приводимый граф
-
5 algebra
algebra with minimality condition — алгебра с условием минимальности, алгебра с условием обрыва убывающих цепей
algebra with maximality condition — алгебра с условием максимальности, алгебра с условием обрыва возрастающих цепей
-
6 model
1) макет; модель || моделировать2) образец4) модель, тип ( изделия)5) шаблон•- countably saturated model - countably uniform model - coupled channels model - finite state model - finitely generated model - game-theory model - random trial increment model - random walk model - sampling model -
7 path
1) путь; трасса2) траектория3) канал; тракт4) дорожка ( магнитной ленты)5) вчт ветвь (программы)6) цепь ( в электрической схеме)7) путь доступа8) контур•- path of a projectile- ray path -
8 problem
1) задача; проблема3) трудность, затруднение•- boundary value problem - card matching problem - central limit problem - decision problem under risk - decision problem under uncertainty - extremum problem - fair division problem - gambling problem - gasoline blending problem - incompletely structured problem - optimal path problem - optimal stopping problem - portfolio selection problem - precisely specified problem - recursively solvable problem - sequential decision programming problem - sequential occupancy problem - shortest path problem - shortest route problem - standard control problem - three houses and three wells problem -
9 process
1) процесс2) процедура3) технологический процесс || технологический4) приём, способ5) обрабатывать; перерабатывать•process with independent increments — процесс с независимыми приращениями, аддитивный процесс
process with nonstationary increments — процесс с нестационарными приращениями, неоднородный во времени процесс
process with stationary and independent increments — процесс со стационарными и независимыми приращениями, однородный процесс
- absorbing barrier process - basic oxygen process - direct reduction process - discrete process - discrete-time process - linearly singular process - locally integrable process - locally stable process - multistep process - multivariate process - N-dimensional process - partially mixing process - process of hidden periodicities - steady stochastic process - temporally homogeneous process - weakly ergodic process - weakly stationary processprocess with stationary increments — процесс со стационарными приращениями, однородный во времени процесс
См. также в других словарях:
Graph property — In graph theory a graph property is any inherently graph theoretical property of graphs (formal definitions follow), distinguished from properties of graphs described in terms of various graph representations: graph drawings, data structures for… … Wikipedia
Connectivity (graph theory) — In mathematics and computer science, connectivity is one of the basic concepts of graph theory: it asks for the minimum number of elements (nodes or edges) which need to be removed to disconnect the remaining nodes from each other[1]. It is… … Wikipedia
Constraint Composite Graph — The constraint composite graph is a node weighted undirected graph associated with a given combinatorial optimization problem posed as a weighted constraint satisfaction problem. Developed and introduced by Satish Kumar Thittamaranahalli (T. K.… … Wikipedia
Cograph — The Turán graph T(13,4), an example of a cograph In graph theory, a cograph, or complement reducible graph, or P4 free graph, is a graph that can be generated from the single vertex graph K1 by complementation and disjoint union. That is, the… … Wikipedia
Four color theorem — Example of a four colored map A four colori … Wikipedia
Cycle double cover — Unsolved problems in mathematics Does every bridgeless graph have a multiset of cycles covering every edge exactly twice? … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
NP-complete — Euler diagram for P, NP, NP complete, and NP hard set of problems In computational complexity theory, the complexity class NP complete (abbreviated NP C or NPC) is a class of decision problems. A decision problem L is NP complete if it is in the… … Wikipedia
SL (complexity) — In computational complexity theory, SL (Symmetric Logspace or Sym L) is the complexity class of problems log space reducible to USTCON ( undirected s t connectivity ), which is the problem of determining whether there exists a path between two… … Wikipedia
P versus NP problem — Unsolved problems in computer science Is P = NP ? … Wikipedia
Circuits over sets of natural numbers — Circuits over natural numbers is a mathematical model used in studying computational complexity theory. It is a special case of circuit, the object is a labeled directed acyclic graph the nodes of which evaluate to sets of natural numbers, the… … Wikipedia
